Complexity and kernels for bipartition into degree-bounded induced graphs
نویسندگان
چکیده
منابع مشابه
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
In this paper, we study the parameterized complexity of the problems of partitioning the vertex set of a graph into two parts VA and VB such that VA induces a graph with degree at most a (resp., an a-regular graph) and VB induces a graph with degree at most b (resp., a b-regular graph). These two problems are called Upper-Degree-Bounded Bipartition and Regular Bipartition respectively. First, w...
متن کاملInduced-Universal Graphs for Graphs with Bounded Maximum Degree
For a family F of graphs, a graph U is induced-universal for F if every graph in F is an induced subgraph of U . We give a construction for an induceduniversal graph for the family of graphs on n vertices with degree at most r, which has Cnb(r+1)/2c vertices and Dn2b(r+1)/2c−1 edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such...
متن کاملOptimal induced universal graphs for bounded-degree graphs
We show that for any constant ∆ ≥ 2, there exists a graph Γ with O(n) vertices which contains every n-vertex graph with maximum degree ∆ as an induced subgraph. For odd ∆ this significantly improves the best-known earlier bound of Esperet et al. and is optimal up to a constant factor, as it is known that any such graph must have at least Ω(n) vertices. Our proof builds on the approach of Alon a...
متن کاملNear-Optimal Induced Universal Graphs for Bounded Degree Graphs
A graph U is an induced universal graph for a family F of graphs if every graph in F is a vertex-induced subgraph of U . For the family of all undirected graphs on n vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an induced universal graph with O ( 2n/2 ) vertices, matching a lower bound by Moon [Proc. of Glasgow Math. Association 1965]. Let k = dD/2e. Improving asymptotically on ...
متن کاملSparse universal graphs for bounded-degree graphs
Let H be a family of graphs. A graph T is H-universal if it contains a copy of each H ∈ H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For all positive integers k and n, we construct an H(k, n)-universal graph T with Ok(n 2 k log 4 k n) edges and exactly n vertices. The number of edges is almost as small as possible, as Ω(n2−2/k) is a lower...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.11.011